Generalized Hilton construction for embedding d-ary quasigroups
نویسندگان
چکیده
منابع مشابه
n-Ary Quasigroups of Order 4
We characterize the set of all n-ary quasigroups of order 4: every n-ary quasigroup of order 4 is permutably reducible or semilinear. Permutable reducibility means that an n-ary quasigroup can be represented as a composition of k-ary and (n− k +1)-ary quasigroups for some k from 2 to n−1, where the order of arguments in the representation can differ from the original order. The set of semilinea...
متن کاملOn reducibility of n-ary quasigroups
An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible if Q(x1, . . . , xn) = P ( R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ) where P and R are (n− k+1)-ary and kary quasigroups, σ is a permutation, and 1 < k < n. Anm-ary ...
متن کاملON CONSTRUCTION OF ORTHOGONAL d-ARY OPERATIONS
A d-hypercube of order n is an n × · · · × nd (d times) array with n elements from a set Q of cardinality n. We recall several connections between d-hypercubes of order n and d-ary operations of order n. We give constructions of orthogonal d-ary operations that generalize a result of Belyavskaya and Mullen. Our main result is a general construction of d-orthogonal d-ary operations from d-ary qu...
متن کاملA generalized concatenation construction for q-ary 1-perfect codes
We consider perfect 1-error correcting codes over a finite field with q elements (briefly q-ary 1-perfect codes). In this paper, a generalized concatenation construction for q-ary 1-perfect codes is presented that allows us to construct q-ary 1-perfect codes of length (q − 1)nm + n +m from the given q-ary 1-perfect codes of length n = (q1 − 1)/(q − 1) and m = (q2 − 1)/(q − 1), where s1, s2 are ...
متن کاملOn reducibility of n-ary quasigroups, II
An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible ifQ(x1, . . . , xn) = P ` R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ́ where P and R are (n − k + 1)-ary and k-ary quasigroups, σ is a permutation, and 1 < k < n. An m-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90162-7